Entanglement and nonlocality are inequivalent for any number of particles

Understanding the relation between nonlocality and entanglement is one of the fundamental problems in quantum physics. In the bipartite case, it is known that the correlations observed for some entangled quantum states can be explained within the framework of local models, thus proving that these resources are inequivalent in this scenario. However, except for a single example of an entangled three-qubit state that has a local model, almost nothing is known about such relation in multipartite systems. We provide a general construction of genuinely multipartite entangled states that do not display genuinely multipartite nonlocality, thus proving that entanglement and nonlocality are inequivalent for any number of particles.Comment: submitted version, 7 pages (4.25 + appendix), 1 figur

Optimal decomposable witnesses without the spanning property

One of the unsolved problems in the characterization of the optimal entanglement witnesses is the existence of optimal witnesses acting on bipartite Hilbert spaces H_{m,n}=C^m\otimes C^n such that the product vectors obeying =0 do not span H_{m,n}. So far, the only known examples of such witnesses were found among indecomposable witnesses, one of them being the witness corresponding to the Choi map. However, it remains an open question whether decomposable witnesses exist without the property of spanning. Here we answer this question affirmatively, providing systematic examples of such witnesses. Then, we generalize some of the recently obtained results on the characterization of 2\otimes n optimal decomposable witnesses [R. Augusiak et al., J. Phys. A 44, 212001 (2011)] to finite-dimensional Hilbert spaces H_{m,n} with m,n\geq 3.Comment: 11 pages, published version, title modified, some references added, other minor improvement

Entangled symmetric states of N qubits with all positive partial transpositions

From both theoretical and experimental points of view symmetric states constitute an important class of multipartite states. Still, entanglement properties of these states, in particular those with positive partial transposition (PPT), lack a systematic study. Aiming at filling in this gap, we have recently affirmatively answered the open question of existence of four-qubit entangled symmetric states with positive partial transposition and thoroughly characterized entanglement properties of such states [J. Tura et al., Phys. Rev. A 85, 060302(R) (2012)] With the present contribution we continue on characterizing PPT entangled symmetric states. On the one hand, we present all the results of our previous work in a detailed way. On the other hand, we generalize them to systems consisting of arbitrary number of qubits. In particular, we provide criteria for separability of such states formulated in terms of their ranks. Interestingly, for most of the cases, the symmetric states are either separable or typically separable. Then, edge states in these systems are studied, showing in particular that to characterize generic PPT entangled states with four and five qubits, it is enough to study only those that assume few (respectively, two and three) specific configurations of ranks. Finally, we numerically search for extremal PPT entangled states in such systems consisting of up to 23 qubits. One can clearly notice regularity behind the ranks of such extremal states, and, in particular, for systems composed of odd number of qubits we find a single configuration of ranks for which there are extremal states.Comment: 16 pages, typos corrected, some other improvements, extension of arXiv:1203.371

Beyond the standard entropic inequalities: stronger scalar separability criteria and their applications

Recently it was shown that if a given state fulfils the reduction criterion it must also satisfy the known entropic inequalities. Now the questions arises whether on the assumption that stronger criteria based on positive but not completely positive maps are satisfied, it is possible to derive some scalar inequalities stronger than the entropic ones. In this paper we show that under some assumptions the extended reduction criterion [H.-P. Breuer, Phys. Rev. Lett 97, 080501 (2006); W. Hall, J. Phys. A 40, 6183 (2007)] leads to some entropic--like inequalities which are much stronger than their entropic counterparts. The comparison of the derived inequalities with other separability criteria shows that such approach might lead to strong scalar criteria detecting both distillable and bound entanglement. In particular, in the case of SO(3)-invariant states it is shown that the present inequalities detect entanglement in regions in which entanglement witnesses based on extended reduction map fail. It should be also emphasized that in the case of $2\otimes N$ states the derived inequalities detect entanglement efficiently, while the extended reduction maps are useless when acting on the qubit subsystem. Moreover, there is a natural way to construct a many-copy entanglement witnesses based on the derived inequalities so, in principle, there is a possibility of experimental realization. Some open problems and possibilities for further studies are outlined.Comment: 15 Pages, RevTex, 7 figures, some new results were added, few references changed, typos correcte

Universal observable detecting all two-qubit entanglement and determinant based separability tests

We construct a single observable measurement of which mean value on four copies of an {\it unknown} two-qubit state is sufficient for unambiguous decision whether the state is separable or entangled. In other words, there exists a universal collective entanglement witness detecting all two-qubit entanglement. The test is directly linked to a function which characterizes to some extent the entanglement quantitatively. This function is an entanglement monotone under so--called local pure operations and classical communication (pLOCC) which preserve local dimensions. Moreover it provides tight upper and lower bounds for negativity and concurrence. Elementary quantum computing device estimating unknown two-qubit entanglement is designed.Comment: 5 pages, RevTeX, one figure replaced by another, tight bounds on negativity and concurrence added, function proved to be a monotone under the pure LOCC, list of authors put in alphabetical orde